Group Element to Power of Group Order is Identity

Specific examples of this fact being useful include Fermat's little theorem and more generally Euler's theorem.

Of course, in an additive group, we use the notation

Proof

This fact follows simply from the fact that the order of each group element divides the order of the group.

That is for any $g\in G$, since $G$ is finite, and the powers up to order in group are distinct, $g$ must have finite order (there are not infinitely many unique elements). Then since $\mathrm{ord}(G)\mid |G|$, we have that $\mathrm{ord}(G)\cdot k=|G|$ for some integer $k$. Then